Coherence depletion in the Grover quantum search algorithm
نویسندگان
چکیده
منابع مشابه
Grover search algorithm
A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum state transformation, operations themselves must be unitary (reversible). Most quantum algorithms involve a series of quantum state transformations followed b...
متن کاملExactness of the Original Grover Search Algorithm
Zijian Diao Mathematics Department, Ohio University Eastern Campus, St Clairsville, OH 43950, USA∗ Abstract It is well-known that when searching one out of four, the original Grover’s search algorithm is exact; that is, it succeeds with certainty. It is natural to ask the inverse question: If we are not searching one out of four, is Grover’s algorithm definitely not exact? In this article we gi...
متن کاملReasoning about Grover ’ s Quantum Search
MICHAEL BUTLER and PIETER HARTEL Department of Electronics & Computer Science University of Southampton Southampton SO17 1BJ United Kingdom {mjb,phh}@ecs.soton.ac.uk Grover's search algorithm is designed to be executed on a quantum-mechanical computer. In this paper, the probabilistic wp-calculus is used to model and reason about Grover's algorithm. It is demonstrated that the calculus provides...
متن کاملAn improved formalism for the Grover search algorithm
James M. Chappell , M. A. Lohe, Lorenz von Smekal, Azhar Iqbal and Derek Abbott School of Electrical and Electronic Engineering, University of Adelaide 5005, Australia School of Chemistry and Physics, University of Adelaide, South Australia 5005, Australia c Institut für Kernphysik, Technische Universität Darmstadt, Schlossgartenstraße 9, 64289 Darmstadt, Germany Email: james.m.chappell@adelaid...
متن کامل0 v 3 9 N ov 1 99 9 Noise in Grover ’ s Quantum Search Algorithm
Grover's quantum algorithm improves any classical search algorithm. We show how random Gaussian noise at each step of the algorithm can be modelled easily because of the exact recursion formulas available for computing the quantum amplitude in Grover's algorithm. We study the algorithm's intrinsic robustess when no quantum correction codes are used, and evaluate how much noise the algorithm can...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2017
ISSN: 2469-9926,2469-9934
DOI: 10.1103/physreva.95.032307